The Smallest Spectral Radius of Graphs with a Given Clique Number
نویسندگان
چکیده
The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω ≥ 2 are obtained.
منابع مشابه
The smallest Laplacian spectral radius of graphs with a given clique number
Article history: Received 23 September 2011 Accepted 30 March 2012 Available online 4 May 2012 Submitted by R.A. Brualdi AMS classification: 05C50
متن کاملThe minimum spetral radius of signless Laplacian of graphs with a given clique number
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω. In addition, we show that the spectral radius μ of PKm,ω (m ≥ 1) satisfies
متن کاملThe minimum spectral radius of graphs with a given clique number
In this paper, it is shown that among connected graphs with maximum clique size ω, the minimum value of the spectral radius of adjacency matrix is attained for a kite graph PKn−ω,ω , which consists of a complete graph Kω to a vertex of which a path Pn−ω is attached. For any fixed ω, a small interval to which the spectral radii of kites PKm,ω , m ≥ 1, belong is exhibited.
متن کاملEla the Minimum Spectral Radius of Graphs with a given Clique Number∗
In this paper, it is shown that among connected graphs with maximum clique size ω, the minimum value of the spectral radius of adjacency matrix is attained for a kite graph PKn−ω,ω , which consists of a complete graph Kω to a vertex of which a path Pn−ω is attached. For any fixed ω, a small interval to which the spectral radii of kites PKm,ω , m ≥ 1, belong is exhibited.
متن کاملWalks and the spectral radius of graphs
Given a graph G, write μ (G) for the largest eigenvalue of its adjacency matrix, ω (G) for its clique number, and wk (G) for the number of its k-walks. We prove that the inequalities wq+r (G) wq (G) ≤ μ (G) ≤ ω (G) − 1 ω (G) wr (G) hold for all r > 0 and odd q > 0. We also generalize a number of other bounds on μ (G) and characterize pseudo-regular and pseudo-semiregular graphs in spectral terms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014